improving seismic facies analysis using wtmmla attributes, self-organizing maps and k-mean clustering
نویسندگان
چکیده
reservoir models are initially generated from estimates of specific rock properties and maps of reservoir heterogeneity. many types of information are used in reservoir model construction. one of the most important sources of information comes from wells, including well logs and core samples. unfortunately well log and core data are local measurements that may not reflect the reservoir behavior as a whole. in addition, well data are not available at the initial phases of exploration. in contrast to sparse well data, 3d seismic data cover large areas. seismic attributes extracted from 3d seismicdata can provide information for the construction of reservoir models. seismic facies analysis can be accomplished through the use of pattern recognition techniques. when the geological information is incomplete or nonexistent, seismic facies analysis can be done using unsupervised learning techniques. one of the most promising mathematical techniques of unsupervised learning is the kohonen's self organizing map (som) (kohonen, 2001). in this paper we use the som and time-frequency analysis to characterize reservoirs. since variations in frequency content are sensitive to subtle changes in reflective information. in this context, we show that the wavelet transform modulus maxima line amplitudes (wtmmla) that extracted from continuous wavelet transforms (cwt) can be applied to detect singularities. these singularities are analyzed and clustered by som. the som networks map points of input space to points in an output space while preserving the topology. topology preservation means that points which are close in the input space should also be close in the output space (map). normally, the input space is of high dimension while the output is two-dimensional. the seismic attributes, can be represented by vectors in the space rn, x = [x1,x2...xn].we assume that the map has pelements; therefore, there will exist p prototype vectors mi, mi= [mi1. . . min], i = 1, 2, . . . ,p, where n is the dimension of the input vector. after the som training, prototype vectors represent the input data set of seismic attributes, the distances between x and all the prototype vectors are computed. the mapunit with the smallest distance mbto the input vector x is called the best matching unit (bmu) and is computed by, . the prototype vector corresponding to the bmu and their neighbors are moved towards the input winner vector in the input space. since one of the main objectives of this work was the identification of data clusters, we displayed the distances between the neighbor prototype vectors to identify similarities among the vector prototypes. we used the u-matrix (ultsch, 1993), to represent these distances. after the som learning, the u-matrix was generated by computing, for each som prototype vector, the distance between the neighbor prototype vectors and their average. for estimation of the number of existing seismic facies in the data, we used a k-means partitive clustering algorithm. we clustered the prototype vectors instead of the original data. in this manner, large data sets formed by the som prototype vectors can be indirectly grouped. results showed that the proposed method not only provides a better understanding about the group formations, but it is also computationally efficient. another benefit of this methodology is noise reduction because the prototype vectors represent local averages of the original data without any loss of resolution. to automate the classification process, we used the davies and bouldin (1979) index (dbi) as means of evaluating the results of the k-means partitioning. transitions, or irregular structures, present in any kind of signals carry information related to its physical phenomena (mallat, 1999). besides the horizon locations, the identified transition characterization in the interpretation is associated with geological processes. in this way, a possible transition classification could be linked to the seismic facies. detection of transitions or singularities in signals is based on simple mathematical concepts. the signal inflection points are associated with the first-derivative extremes which correspond to the second-derivative zero crossings. for the signal inflection-point positions, using the cwt local peak locations, a wavelet should be chosen as the first-derivative of the smoothing function . one of the wavelet functions that fulfill this requirement is the first-derivative of the gaussian function, called the gauss wavelet. we can extract scalogram's local peaks coincide from the signal inflection points. it can be proven that these lines, which are called wtmmla, can be used to characterize the signal irregularity. the signal irregularities can be characterized mathematically through the wtmmla and h?lder exponent (mallat, 1999). the exponent can be obtained from the slope estimation of the curve created by the log2 of the wtmmla coefficients divided by the log2 of the scales. in this study we used wtmmla as a direct seismic attribute. we calculated cwt coefficients and wtmmla for sixteen seismic data samples around the picked reservoir horizon. the extracted wtmmla can show the possible heterogeneity and singularity within the reservoir. we used these attribute as input vector for the som step and obtained the u_matrix. the k-mean and dbi estimate the number of seismic facies.utilizing of cwt to locate events in time through the identification of signal singularities also proved to be useful as an appropriate tool for detection of seismic events. therefor this method proved to be less sensitive to interpretation errors. the performance of the method was tested on kangan formation at one of the iranian oil fields.
منابع مشابه
using game theory techniques in self-organizing maps training
شبکه خود سازمانده پرکاربردترین شبکه عصبی برای انجام خوشه بندی و کوانتیزه نمودن برداری است. از زمان معرفی این شبکه تاکنون، از این روش در مسائل مختلف در حوزه های گوناگون استفاده و توسعه ها و بهبودهای متعددی برای آن ارائه شده است. شبکه خودسازمانده از تعدادی سلول برای تخمین تابع توزیع الگوهای ورودی در فضای چندبعدی استفاده می کند. احتمال وجود سلول مرده مشکلی اساسی در الگوریتم شبکه خودسازمانده به حسا...
Self-organizing Maps as Substitutes for K-Means Clustering
One of the most widely used clustering techniques used in GISc problems is the k-means algorithm. One of the most important issues in the correct use of k-means is the initialization procedure that ultimately determines which part of the solution space will be searched. In this paper we briefly review different initialization procedures, and propose Kohonen’s SelfOrganizing Maps as the most con...
متن کاملSelf-Organizing Maps in Seismic Image Segmentation
Unsupervised neural networks such as the Kohonen Self-Organizing Maps (SOM) have been widely used for searching natural clusters in multidimensional and massive data. One example where the data available for analysis can be extremely large is seismic interpretation for hydrocarbon exploration. In order to assist the interpreter in identifying characteristics of interest confined in the seismic ...
متن کاملK-Dynamical Self Organizing Maps
Neural maps are a very popular class of unsupervised neural networks that project high-dimensional data of the input space onto a neuron position in a low-dimensional output space grid. It is desirable that the projection effectively preserves the structure of the data. In this paper we present a hybrid model called K-Dynamical Self Organizing Maps (KDSOM ) consisting of K Self Organizing Maps ...
متن کاملDetermining an Optimal Seismic Network Configuration Using Self-Organizing Maps
The Seismic Research Centre, University of the West Indies operates a seismic network that performs suboptimally in detecting, locating, and correctly determining the magnitude of earthquakes due to a diverse constituion of seismometers and the utilization of a site selection process that approximates an educated guess. My work seeks to apply Self-Organizing Maps (SOM) to arrive at the optimal ...
متن کاملGene Clustering Using Self-Organizing Maps and Particle Swarm Optimization
Gene clustering, the process of grouping related genes in the same cluster, is at the foundation of different genomic studies that aim at analyzing the function of genes. Microarray technologies have made it possible to measure gene expression levels for thousand of genes simultaneously. For knowledge to be extracted from the datasets generated by these technologies, the datasets have to be pre...
متن کاملمنابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
فیزیک زمین و فضاجلد ۳۸، شماره ۲، صفحات ۴۵-۵۶
کلمات کلیدی
میزبانی شده توسط پلتفرم ابری doprax.com
copyright © 2015-2023